Bisimulations and abstraction homomorphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Games for Bisimulations and Abstraction

Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its specification, pinpointing the root cause can be challenging. In this paper we provide a generic characterisation of branching-, delay-, ηand weak-bisimulation as a g...

متن کامل

Bisimulations, Games and Logic

In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extens...

متن کامل

Bisimulations and Boolean Vectors

A modal accessibility relation is just a transition relation, and so can be represented by a {0,1} valued transition matrix. Starting from this observation, I first show that the machinery of matrices, over Boolean algebras more general than the two-valued one, is appropriate for investigating multi-modal semantics. Then I show that bisimulations have a rather elegant theory, when expressed in ...

متن کامل

Bisimulations and Predicate Logic

Elementary ((rst-order) and non-elementary (set-theoretic) aspects of the largest bisimulation are considered , with a view towards analyzing operational semantics from the perspective of predicate logic. The notion of a bisimulation is employed in two distinct ways: (i) as an extensional notion of equivalence on programs (or processes) generalizing input/output equivalence (at a cost exceeding...

متن کامل

Relators and Metric Bisimulations

Coalgebras of set functors preserving weak pullbacks are particularly well behaved Invoking a result by Carboni Kelly and Wood we show that this can be explained by the fact that such functors can be uniquely extended to a relator This insight next suggests a de nition of metric bisimulation

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1987

ISSN: 0022-0000

DOI: 10.1016/0022-0000(87)90025-0